An asymptotic representation for products of random matrices

Asymptotic Lyapunov Exponents for Large Random Matrices

Suppose that A1, . . . , AN are independent random matrices whose atoms are iid copies of a random variable ξ of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when ξ is gaussian then N−1 log ‖AN . . . A1‖ converges to a non-random limit. We extend this result to more general matrices with explicit rate of convergence. Our method relies on a simple...

Asymptotic Freeness Almost Everywhere for Random Matrices

Voiculescu’s asymptotic freeness result for random matrices is improved to the sense of almost everywhere convergence. The asymptotic freeness almost everywhere is first shown for standard unitary matrices based on the computation of multiple moments of their entries, and then it is shown for rather general unitarily invariant selfadjoint random matrices (in particular, standard selfadjoint Gau...

Products of random matrices for disordered systems.

Products of random transfer matrices are applied to low dimensional disordered systems to evaluate numerically extensive quantities such as entropy and overlap probability distribution. The main advantage is the possibility to avoid numerical differentiation. The method works for arbitrary disorder distributions at any temperature. 75.10.Nr, 05.50.+q, 02.50.+s Typeset using REVTEX 1 Products of...

Lyapunov Exponent for Products of Random Matrices

Row Products of Random Matrices

Let ∆1, . . . ,∆K be d × n matrices. We define the row product of these matrices as a d × n matrix, whose rows are entry-wise products of rows of ∆1, . . . ,∆K . This construction arises in certain computer science problems. We study the question, to which extent the spectral and geometric properties of the row product of independent random matrices resemble those properties for a d × n matrix ...